data structures & algorithms Practice Questions Answers Test with Solutions & More Shortcuts

Question : 21

Arrays are best data structures for

a) relatively permanent collections of data

b) the size of the structure and the data in the structure are constantly changing

c) both of above situation

d) none of above situation

Question : 22

The term “push” and “pop” is related to the

a) Array

b) Lists

c) stacks

d) all of above

Question : 23

A binary tree whose every node has either zero or two children is called

a) Complete binary tree

b) Binary search tree

c) Extended binary tree

d) None of above

Question : 24

The complexity of the average case of an algorithm is

a) Much more complicated to analyze than that of worst case

b) Much more simpler to analyze than that of worst case

c) Sometimes more complicated and some other times simpler than that of worst case

d) None of the above

Question : 25

The complexity of Bubble sort algorithm is

a) O(n)

b) O (n ₂ )

c) O(n log n)

d) None of the above